On a New Boolean Function with Applications

نویسندگان

  • Fabrizio Luccio
  • Linda Pagli
چکیده

ÐConsider a hypercube of 2 points described by n Boolean variables and a subcube of 2 points, m n. As is well-known, the Boolean function with value 1 in the points of the subcube can be expressed as the product (AND) of nÿm variables. The standard synthesis of arbitrary functions exploits this property. We extend the concept of subcube to the more powerful pseudocube. The basic set is still composed of 2 points, but has a more general form. The function with value 1 in a pseudocube, called pseudoproduct, is expressed as the AND of nÿm EXOR-factors, each containing at most m‡ 1 variables. Subcubes are special cases of pseudocubes and their corresponding pseudoproducts reduce to standard products. An arbitrary Boolean function can be expressed as a sum of pseudoproducts (SPP). This expression is in general much shorter than the standard sum of products, as demonstrated on some known benchmarks. The logical network of an n-bit adder is designed in SPP, as a relevant example of application of this new technique. A class of symmetric functions is also defined, particularly suitable for SPP representation. Index TermsÐPseudocube, pseudoproduct, EXOR-factor, Boolean function, algebraic expression, logical design.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES

Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...

متن کامل

Improved Skips for Faster Postings List Intersection

Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...

متن کامل

Improved Skips for Faster Postings List Intersection

Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...

متن کامل

Reliability assessment of power distribution systems using disjoint path-set algorithm

Finding the reliability expression of different substation configurations can help design a distribution system with the best overall reliability. This paper presents a computerized a nd implemented algorithm, based on Disjoint Sum of Product (DSOP) algorithm. The algorithm was synthesized and applied for the first time to the determination of reliability expression of a substation to determine...

متن کامل

On some classes of expansions of ideals in $MV$-algebras

In this paper, we introduce the notions of expansion of ideals in $MV$-algebras, $ (tau,sigma)- $primary, $ (tau,sigma)$-obstinate  and $ (tau,sigma)$-Boolean  in $ MV- $algebras. We investigate the relations of them. For example, we show that every $ (tau,sigma)$-obstinate ideal of an $ MV-$ algebra is $ (tau,sigma)$-primary  and $ (tau,sigma)$-Boolean. In particular, we define an expansion $ ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Computers

دوره 48  شماره 

صفحات  -

تاریخ انتشار 1999